Almost Flat Line Configurations
نویسندگان
چکیده
منابع مشابه
Almost Flat Manifolds
1.1. We denote by V a connected ^-dimensional complete Riemannian manifold, by d = d(V) the diameter of V, and by c = c(V) and c~ = c~(V), respectively, the upper and lower bounds of the sectional curvature of V. We set c = c(V) = max (| c1, | c~ |). We say that F i s ε-flat, ε > 0, if cd < ε. 1.2. Examples. a. Every compact flat manifold is ε-flat for any ε > 0. b. Every compact nil-manifold p...
متن کاملFlat counter automata almost everywhere!
This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be “replaced”, equivalently w.r.t. reachability, by another one with no nested loops. From a practical view point, we show that flatness is a necessary and sufficient condition for termination of accelerated symbolic model checking, a...
متن کاملFlat Central Configurations of Four Planet Motions
Abst rac t . The flat central configurations of four planet motions are investigated with ~¥u's elimination method. ~¥e obtain 12 collinear central configurations and a necessary condition for determining flat but noncollinear central configurations. We also prove that the number of central configurations in planet motions of 4 bodies is finite under the condition that the masses and angular ve...
متن کاملAlmost Periodic Configurations on Linear Cellular Automata
We study computational properties of linear cellular automata on configurations that differ from spatially periodic ones in only finitely many places. It is shown that the degree structure of the orbits of cellular automata is the same on these configurations as on the space of finite configurations. We also show that it is undecidable whether the cellular automaton exhibits complicated behavio...
متن کاملAlmost Flat Functional Semantics for Speech Translation
We introduce a novel semantic representation formalism, Almost Flat Functional semantics (AFF), which is designed as an intelligent compromise between linguistically motivated predicate/argument semantics and ad hoc engineering solutions based on flat feature/value lists; the central idea is to tag each semantic element with the functional marking which most closely surrounds it. We argue that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 1999
ISSN: 0196-8858
DOI: 10.1006/aama.1999.0647